Bijections from Dyck paths to 321-avoiding permutations revisited

نویسنده

  • DAVID CALLAN
چکیده

There are at least three di erent bijections in the literature from Dyck paths to 321-avoiding permutations, due to Billey-Jockusch-Stanley, Krattenthaler, and Mansour-Deng-Du. How di erent are they? Denoting them B;K;M respectively, we show that M = B Æ L = K Æ L where L is the classical Kreweras-Lalanne involution on Dyck paths and L0, also an involution, is a sort of derivative of L. Thus K 1 Æ B, a measure of the di erence between B and K, is the product of involutions L ÆL and turns out to be a very curious bijection: as a permutation on Dyck n-paths it is an nth root of the \reverse path" involution. The proof of this fact boils down to a geometric argument involving pairs of nonintersecting lattice paths.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Restricted Dumont permutations, Dyck paths, and noncrossing partitions

We complete the enumeration of Dumont permutations of the second kind avoiding a pattern of length 4 which is itself a Dumont permutation of the second kind. We also consider some combinatorial statistics on Dumont permutations avoiding certain patterns of length 3 and 4 and give a natural bijection between 3142-avoiding Dumont permutations of the second kind and noncrossing partitions that use...

متن کامل

Dyck paths and restricted permutations

This paper is devoted to characterize permutations with forbidden patterns by using canonical reduced decompositions, which leads to bijections between Dyck paths and Sn(321) and Sn(231), respectively. We also discuss permutations in Sn avoiding two patterns, one of length 3 and the other of length k. These permutations produce a kind of discrete continuity between the Motzkin and the Catalan n...

متن کامل

Avoiding patterns in irreducible permutations

We explore the classical pattern avoidance question in the case of irreducible permutations, i.e., those in which there is no index i such that σ(i + 1) − σ(i) = 1. The problem is addressed completely in the case of avoiding one or two patterns of length three, and several well known sequences are encountered in the process, such as Catalan, Motzkin, Fibonacci, Tribonacci, Padovan and Binary nu...

متن کامل

Statistics on Pattern-avoiding Permutations

This thesis concerns the enumeration of pattern-avoiding permutations with respect to certain statistics. Our first result is that the joint distribution of the pair of statistics ‘number of fixed points’ and ‘number of excedances’ is the same in 321-avoiding as in 132-avoiding permutations. This generalizes a recent result of Robertson, Saracino and Zeilberger, for which we also give another, ...

متن کامل

Pattern Avoidance in Permutations: Linear and Cyclic Orders

We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the first one corresponding to classical permutation avoidance. The cyclic modification allows for circular shifts in the entries. Using two bijections, both ascribable to both Deutsch and Krattenthaler independently, we sin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007